package gold.digger;

import gold.utils.InputUtil;
import gold.vo.TreeNode;

/**
 * Created by fanzhenyu02 on 2021/12/10.
 * common problem solver template.
 */
public class LC998 {
    public long startExecuteTime = System.currentTimeMillis();


    class Solution {
        public TreeNode insertIntoMaxTree(TreeNode root, int val) {
            if (null == root) return new TreeNode(val);
            if (val >= root.val) {
                TreeNode cur = new TreeNode(val);
                cur.left = root;
                return cur;
            } else {
                root.right = insertIntoMaxTree(root.right, val);
                return root;
            }
        }
    }

    public void run() {
        Solution solution = new Solution();
        int[] arr = InputUtil.toIntegerArray("[1,2,3]");
        System.out.println(solution.toString());
    }

    public static void main(String[] args) throws Exception {
        LC998 an = new LC998();
        an.run();

        System.out.println("\ncurrent solution total execute time: " + (System.currentTimeMillis() - an.startExecuteTime) + " ms.");
    }
}
